Implementation of Rabin Karp String Matching Algorithm Using MPI

Searching for occurrences of string patterns is a common problem in many applications. One of the easiest approaches is to search a pattern in a text character by character. But this method becomes very slow when we deal with long patterns. Various good solutions like Naïve string Matcher, Knuth-Morris-Pratt (KMP), Rabin Karp (RK), etc have already been presented for string matching and we selected Rabin Karp for this project. However, the main focus of this project is to apply the concepts of parallelism to further improve the performance of the algorithm. There are lots of parallel processing languages and API’s available like OpenMP, MPI, MapReduce, etc and we chose MPI and OpenMP to achieve parallelism for this project. We started with analyzing the algorithm in serial mode to get a better understanding of the nature of the algorithm and then further design it for achieving parallelism. Later comparing the results of both serial and parallel implementation gave us insights into how performance and efficiency is achieved through various techniques of Parallelism.